An Efficient Data Retrieval Parallel Reeb Graph Algorithm

Reeb Graph Based Shape Retrieval for Cad

Our recent work has described a framework for matching solid of mechanical artifacts models based on scale-space feature decomposition. In this work we adopt a method of comparing solid models based on Multiresolutional Reeb Graphs (MRG) similarity computations. This method was originally proposed by Hilaga et al. in [1]. Reeb Graph technique applies MRG structure to comparisons of approximate ...

Efficient graph algorithm execution on data-parallel architectures

An Efficient Parallel Algorithm for Graph-Based Image Segmentation

Automatically partitioning images into regions (‘segmentation’) is challenging in terms of quality and performance. We propose a Minimum Spanning Tree-based algorithm with a novel graph-cutting heuristic, the usefulness of which is demonstrated by promising results obtained on standard images. In contrast to data-parallel schemes that divide images into independently processed tiles, the algori...

A Fast Algorithm for Computing Reeb Graph of 2-Manifold

The notion of Reeb graph is part of the Morse theory which provides an analysis of the relationship between the topology and the geometrical information of a space given by a suitable function, a Morse function. Until recently, the main drawback for using Reeb graph analysis was the incapacity of constructing adequate Morse functions. Before the work of Ni et al. [2004], the used Morse function...

An Efficient Parallel Biconnectivity Algorithm